Efficient and Scalable Universal Circuits
نویسندگان
چکیده
منابع مشابه
Efficient Universal Quantum Circuits
We define and construct efficient depth-universal and almostsize-universal quantum circuits. Such circuits can be viewed as generalpurpose simulators for central quantum circuit classes and used to capture the computational power of the simulated class. For depth we construct universal circuits whose depth is the same order as the circuits being simulated. For size, there is a log factor blow-u...
متن کاملEfficient and universal scalable video coding
This paper proposes a unified efficient and universal scalable video coding framework that supports different scalabilities, such as fine granularity quality, temporal, spatial and complexity scalabilities. The proposed framework is established upon the recent studies in fine granularity scalable (FGS) video coding. It contains two key points. Firstly, in order to improve the coding efficiency ...
متن کاملEfficient circuits for exact-universal computationwith qudits
This paper concerns the efficient implementation of quantum circuits for qudits. We show that controlled two-qudit gates can be implemented without ancillas and prove that the gate library containing arbitrary local unitaries and one two-qudit gate, CINC, is exact-universal. A recent paper [S.Bullock, D.O’Leary, and G.K. Brennen, Phys. Rev. Lett. 94, 230502 (2005)] describes quantum circuits fo...
متن کاملEfficient Synthesis of Universal Probabilistic Quantum Circuits†
Techniques to efficiently compile higher-level quantum algorithms into lower-level fault-tolerant circuits are needed for the implementation of a scalable, general purpose quantum computer. Several universal gate sets arise from augmenting the set of Clifford gates by additional gates that arise naturally from the underlying fault-tolerance scheme. Examples are the Clifford+T basis which arises...
متن کاملEfficient Scalable Constant-Round MPC via Garbled Circuits
In the setting of secure multiparty computation, a set of mutually distrustful parties carry out a joint computation of their inputs, without revealing anything but the output. Over recent years, there has been tremendous progress towards making secure computation practical, with great success in the two-party case. In contrast, in the multiparty case, progress has been much slower, even for th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cryptology
سال: 2020
ISSN: 0933-2790,1432-1378
DOI: 10.1007/s00145-020-09346-z